APLIKASI BINARY INTEGER PROGRAMMING PADA PENYELESAIAN MASALAH LINE BALANCING
نویسندگان
چکیده
منابع مشابه
Binary decision diagrams and integer programming
In this work we show how Binary Decision Diagrams can be used as a powerful tool for 0/1 Integer Programming and related polyhedral problems. We develop an output-sensitive algorithm for building a threshold BDD, which represents the feasible 0/1 solutions of a linear constraint, and give a parallel and -operation for threshold BDDs to build the BDD for a 0/1 IP. In addition we construct a 0/1 ...
متن کاملGradient Methods for Binary Integer Programming
Integer Programming (IP) is a common problem class where decision variables represent indivisibility or yes/no decisions. IP can also be interpreted as discrete optimizations which are extensively used in the areas of routing decisions, fleet assignment, and aircraft/aircrew scheduling. Solving IP models is much harder than solving Linear Programming (LP) models because of their intrinsically c...
متن کاملParsimonious binary-encoding in integer programming
We describe an effective method for doing binary-encoded modeling, in the context of 0/1 linear programming, when the number of feasible configurations is not a power of two. Our motivation comes from modeling all-different restrictions.
متن کاملAn Integer Programming Based Formulation of the U-line Balancing Problem
We develop an integer programming formulation of the U line balancing problem and develop a solution procedure based on Lagrangian relaxation to address this problem. Two intuitive heuristics are proposed to improve the solution. Computational results indicate that this method provides an efficient basis to solve several practical large size problems to optimality.
متن کاملThe type E simple assembly line balancing problem: A mixed integer linear programming formulation
Although the simple assembly line balancing problem (SALBP) is the topic of many studies, typically they either consider minimizing the number of stations for a given cycle time (called type one), or minimizing the cycle time for a given number of stations (called type two). Rarely, type E of the problem has been considered. In the type E, cycle time and number of stations are both decision var...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jurnal Teknobisnis
سال: 2017
ISSN: 2460-9463,0216-5996
DOI: 10.12962/j24609463.v2i1.2812